منابع مشابه
Constrained versions of Sauer's lemma
Let [n] = {1, . . . , n}. For a function h : [n] → {0, 1}, x ∈ [n] and y ∈ {0, 1} define by the width ωh(x, y) of h at x the largest non-negative integer a such that h(z) = y on x− a ≤ z ≤ x+ a. We consider finite VC-dimension classes of functions h constrained to have a width ωh(xi, yi) which is larger than N for all points in a sample ζ = {(xi, yi)}1 or a width no larger than N over the whole...
متن کاملPPAD-completeness of polyhedral versions of Sperner's Lemma
We show that certain polyhedral versions of Sperner’s Lemma, where the colouring is given explicitly as part of the input, are PPAD-complete. The proofs are based on two recent results on the complexity of computational problems in game theory: the PPAD-completeness of 2-player Nash, proved by Chen and Deng, and of Scarf’s Lemma, proved by Kintali. We show how colourings of polyhedra provide a ...
متن کاملArea, Capacity and Diameter Versions of Schwarz’s Lemma
The now canonical proof of Schwarz’s Lemma appeared in a 1907 paper of Carathéodory, who attributed it to Erhard Schmidt. Since then, Schwarz’s Lemma has acquired considerable fame, with multiple extensions and generalizations. Much less known is that, in the same year 1907, Landau and Toeplitz obtained a similar result where the diameter of the image set takes over the role of the maximum modu...
متن کاملImproved algorithmic versions of the Lovász Local Lemma
The Lovász Local Lemma is a powerful tool in combinatorics and computer science. The original version of the lemma was nonconstructive, and efficient algorithmic versions have been developed by Beck, Alon, Molloy & Reed, et al. In particular, the work of Molloy & Reed lets us automatically extract efficient versions of essentially any application of the symmetric version of the Local Lemma. How...
متن کاملTwo versions of Nakayama lemma for multiplication modules
The aim of this note is to generalize the Nakayama lemma to a class of multiplication modules over commutative rings with identity. In this note, by considering the notion of multiplication modules and the product of submodules of them, we state and prove two versions of Nakayama lemma for such modules. In the first version we give some equivalent conditions for faithful finitely generated mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.11.017